A Continuous Plane Model to Machine Layout Problems Considering Pick-Up and Drop-Off Points: An Evolutionary Algorithm

نویسنده

چکیده مقاله:

One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such problems may be formulated as a continuous plane model that is applicable to cellular manufacturing systems. The aim is to assign all the machines to the related locations within the floor plan in such a way that an objective function, as the total material handling is optimized while satisfying all the constraints. In this paper, a GA methodology is used to generate promising and feasible layout solutions and to find the best or near-optimal solution searched within the space problem. For this purpose, a new genetic presentation and genetic operators are designed. Finally, computational results reported by the GA program and a construction algorithm are presented in the context of the test problems. In addition to the above objective function, the dead space ratio of final layout solution is calculated for each test problem.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Continuous Plane Model to Machine Layout Problems Considering Pick-up and Drop-offpoints: an Evolutionary Algorithm

One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...

متن کامل

A solution to the facility layout problem using simulated annealing

Ž . In this paper a solution in the continual plane to the Facility Layout Problem FLP is presented. It is based on Simulated Ž . Annealing SA , a relatively recent algorithm for solving hard combinatorial optimization problems, like FLP. This approach Ž . may be applied either in General Facility Layout Problems GFLP considering facilities areas, shapes and orientations or in Ž . Machine Layou...

متن کامل

Harnessing fluid-driven vesicles to pick up and drop off Janus particles.

Using dissipative particle dynamics (DPD) simulations, we model the interaction between nanoscopic lipid vesicles and Janus nanoparticles in the presence of an imposed flow. Both the vesicle and Janus nanoparticles are localized on a hydrophilic substrate and immersed in a hydrophilic solution. The fluid-driven vesicle successfully picks up Janus particles on the substrate and transports these ...

متن کامل

Mask-Layout Synthesis Through an Evolutionary Algorithm

An automatic method for synthesizing MEMS mask-layouts is presented. This method uses evolutionary algorithm techniques to optimize the mask-layouts for a forward simulation of fabrication. Initially, a random population of masklayouts is generated. The fabrication of each layout is simulated through a digital process simulator to produce a 3D fabricated shape, which is compared to a user-speci...

متن کامل

A New Play-off Approach in League Championship Algorithm for Solving Large-Scale Support Vector Machine Problems

There are many numerous methods for solving large-scale problems in which some of them are very flexible and efficient in both linear and non-linear cases. League championship algorithm is such algorithm which may be used in the mentioned problems. In the current paper, a new play-off approach will be adapted on league championship algorithm for solving large-scale problems. The proposed algori...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 16  شماره 1

صفحات  59- 70

تاریخ انتشار 2003-04-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023